System and Clique
نویسندگان
چکیده
منابع مشابه
Clique partitions and clique coverings
Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph . For a graph on n vertices, the clique partition number can grow cn z times as fast as the clique covering number, where c is at least 1/64. If in a clique on n vertices, the edges between en° vertices are deleted, Z--a < 1, then the number of cliques needed to partition what is left is asy...
متن کاملAn Ant System Algorithm for Maximum Clique
This paper presents a hybrid algorithm for solving the maximum clique problem. The algorithm is a blend of agent-based and local optimization techniques. Unlike typical Ant Colony Optimization (ACO) algorithms, agents in this algorithm are denied global knowledge. This restriction facilitates the expansion of this solution into a distributed algorithm capable of running across a network. Experi...
متن کاملSystem Synthesis with Generalized Morphological Clique Problem
System synthesis as an integration (fusion) of local decisions into a global one is examined on the basis of a generalization of morphological clique model (an optimization extended version of morphological analysis). The paper addresses the following: (a) structure of compatibility between system components and its innuence to problem complexity, (b) some kinds compatibility for the components...
متن کاملOn Clique-Transversals and Clique-Independent Sets
A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. A cliqueindependent set is a subset of pairwise disjoint cliques of G. Denote by τC(G) and αC(G) the cardinalities of the minimum clique-transversal and maximum clique-independent set of G, respectively. Say that G is clique-perfect when τC(H) = αC(H), for every induced subgraph H of G. In this paper, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Sociology
سال: 1910
ISSN: 0002-9602,1537-5390
DOI: 10.1086/211869